Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
نویسندگان
چکیده
منابع مشابه
Graphs with Least Eigenvalue −2 Attaining a Convex Quadratic Upper Bound for the Stability Number
AMS Mathematics Subject Classification (2000): 05C50
متن کاملOn trees attaining an upper bound on the total domination number
A total dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every vertex of $G$ has a neighbor in $D$. The total domination number of a graph $G$, denoted by $gamma_t(G)$, is~the minimum cardinality of a total dominating set of $G$. Chellali and Haynes [Total and paired-domination numbers of a tree, AKCE International ournal of Graphs and Combinatorics 1 (2004), 6...
متن کاملNotes on graphs with least eigenvalue at least -2
A new proof concerning the determinant of the adjacency matrix of the line graph of a tree is presented and an invariant for line graphs, introduced by Cvetković and Lepović, with least eigenvalue at least −2 is revisited and given a new equivalent definition [D. Cvetković and M. Lepović. Cospectral graphs with least eigenvalue at least −2. Publ. Inst. Math., Nouv. Sér., 78(92):51–63, 2005.]. E...
متن کاملA new upper bound for the bondage number of graphs with small domination number
Let, of the domination number of graph. The bondage number G was first introduced by Fink, Jacobson, the minimum among all sets of holds. In this paper we show that for graph G satisfying
متن کاملAn upper bound for the chromatic number of line graphs
It was conjectured by Reed [12] that for any graph G, the graph’s chromatic number χ(G) is bounded above by l ∆(G)+1+ω(G) 2 m , where ∆(G) and ω(G) are the maximum degree and clique number of G, respectively. In this paper we prove that this bound holds if G is the line graph of a multigraph. The proof yields a polynomial time algorithm that takes a line graph G and produces a colouring that ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin: Classe des sciences mathematiques et natturalles
سال: 2006
ISSN: 0561-7332
DOI: 10.2298/bmat0631041c